Anti-Aliased Lines Using Run-Masks

نویسندگان

  • Nicholas Diakopoulos
  • Peter D. Stephenson
چکیده

In recent work, a set of line digitization algorithms based on the hierarchy of runs in the digital line has unified and generalized the iterative line-drawing algorithms used in computer graphics. In this paper, the additional structural information generated by these algorithms is leveraged to describe a run-based approach to draw anti-aliased line segments in which anti-aliased run-masks are substituted for the individual run lengths as the line is being drawn. The run-masks are precomputed using a prefiltering technique such that one or more run-masks are defined for each of the one or two possible run lengths that occur in the line. The run-masks can be defined for any order or level of the hierarchy of runs in the digital line and the technique is illustrated using runs of pixels. Comparing the use of run-masks to applying the prefiltering technique for each pixel in the line, a line of similar visual quality can be produced more efficiently. We place no restrictions on the placement of the end points of the line, which may reside anywhere on the two-dimensional plane.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The perceived orientation of aliased lines

The use of raster display devices for the display of graphics causes problems of aliasing when edges or lines are produced. This can be significant in those psychophysical experiments where the orientational properties of the stimulus are important. We have assessed the perceived orientation of a selection of aliased lines by comparing them with the orientation of pairs of dots. It is found tha...

متن کامل

Combining Edges and Points for Interactive Anti-Aliased Rendering

This paper presents a new rendering and display paradigm that uses both discontinuities (edges) and sparsely sampled shading (points) to interactively generate anti-aliased images of complex scenes. Geometric and shadow discontinuities in the image are found at interactive rates using a novel data structure, the Normal–Position Interval tree, and algorithms based on interval arithmetic. After p...

متن کامل

On Drawing Anti-Aliased Straight Lines

In this paper, an efficient algorithm is presented for drawing anti-aliased straight lines for two grey-level case; experimental results show that it is faster than Liu’s algorithm [6]. Specifically, Liu’s algorithm determines the grey-level of one pixel at a time while our algorithm determines the grey-levels of many pixels at the same time. In addition, our results for the two grey-level case...

متن کامل

Anti-Aliased Volume Extraction

We present a technique to extract regions from a volumetric dataset without introducing any aliasing so that the extracted volume can be explored using direct volume rendering techniques. Extracting regions using binary masks generated by contemporary segmentation approaches typically introduces aliasing at the boundary of the extracted regions. This aliasing is especially visible when the data...

متن کامل

Synthetic Target combined with PILS (ST-PILS) for improving SNR in parallel imaging

Introduction: GRAPPA [1] is an effective self-calibrated algorithm for parallel imaging reconstruction. However, GRAPPA can be time-consuming when using a large number of coils because of its coil-by-coil reconstruction nature. PILS [2] (Parallel Imaging with Localized Sensitivities) is another popular reconstruction technique with fast reconstruction speed and high SNR. But it suffers from sev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2005